Subset simulation for unconstrained global optimization
نویسندگان
چکیده
منابع مشابه
Semidefinite Approximations for Global Unconstrained Polynomial Optimization
We consider the problem of minimizing a polynomial function on R, known to be hard even for degree 4 polynomials. Therefore approximation algorithms are of interest. Lasserre [15] and Parrilo [23] have proposed approximating the minimum of the original problem using a hierarchy of lower bounds obtained via semidefinite programming relaxations. We propose here a method for computing tight upper ...
متن کاملRobust Optimization for Unconstrained Simulation-Based Problems
In engineering design, an optimized solution often turns out to be suboptimal, when errors are encountered. While the theory of robust convex optimization has taken significant strides over the past decade, all approaches fail if the underlying cost function is not explicitly given; it is even worse if the cost function is nonconvex. In this work, we present a robust optimization method, which ...
متن کاملA Kriging-based Unconstrained Global Optimization Algorithm
Efficient Global Optimization (EGO) algorithm with Kriging model is stable and effective for an expensive black-box function. However, How to get a more global optimal point on the basis of surrogates has been concerned in simulation-based design optimization. In order to better solve a black-box unconstrained optimization problem, this paper introduces a new EGO method named improved generaliz...
متن کاملGlobal Convergence of a Memory Gradient Method for Unconstrained Optimization
The memory gradient method is used for unconstrained optimization, especially large scale problems. The first idea of memory gradient method was proposed by Miele and Cantrell (1969) and Cragg and Levy (1969). In this paper, we present a new memory gradient method which generates a descent search direction for the objective function at every iteration. We show that our method converges globally...
متن کاملTerminal Repeller Unconstrained Subenergy Tunneling ( TRUST ) for Fast Global Optimization ’
A new method for unconstrained global function optimization, acronymed TRUST, is introduced. This method formulates optimization as the solution of a deterministic dynamical system incorporating terminal repellers and a novel subenergy tunneling function. Benchmark tests comparing this method to other global optimization procedures are presented, and the TRUST algorithm is shown to be substanti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2011
ISSN: 0307-904X
DOI: 10.1016/j.apm.2011.04.023